Partial Order Based Modeling of Concurrency at the System Level
نویسنده
چکیده
Concurrency at the System Level Francisco Assis Moreira do Nascimento Wolfgang Rosenstiel University of T ubingen, Wilhelm Schickard Institute Dept of Computer Engineering, Sand 13 D-70076 T ubingen Germany Phone: ++49 7071 2978971 FAX: ++49 7071 610399 [email protected] http://www-ti.informatik.uni-tuebingen/~moreira Abstract The Partial Order based Model (POM) is an alternative to model concurrency, which permits a concise symbolic representation, mainly for systems with high degree of parallelism. In this paper we introduce the partial order based model for concurrency and how to use it in modeling at the system level; we present a symbolic representation for the model and its implementation using BDDs; we give reachability analysis algorithms that can be used by performance analysis tasks and formal veri cation; and nally we introduce our co-synthesis approach based on the model.
منابع مشابه
Co-synthesis Using a Partial Order Based Model of Concurrency
We deene a Partial Order based Model (POM) as an alternative to model concurrency at a high level of abstraction. The model permits a concise symbolic representation, mainly for systems with high degree of parallelism, and the use of eecient reachability analysis techniques based on partial order reductions. In our design approach, from a speciication without details of implementation modeled w...
متن کاملA Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملA Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملA Symbolic Partial Order Reduction Algorithm for Rule Based Transition Systems
Partial order reductions are a class of methods that attempt to reduce the state space that must be explored to verify systems by explicit state enumeration. Partial order reduction algorithms have been successfully incorporated into tools such as Spin and VFSM-valid. However, current partial order algorithms assume that the concurrency model is based on processes. Rule based formalisms, such a...
متن کاملA partial-order-based simulation and validation approach for high-level Petri nets
This contribution describes a simulation concept for systems modelled by high-level Petri nets based on partial-order semantics. The main advantage of this approach is its ability to represent and visualize causal dependencies and concurrency explicitly and to give the user a much more intuitive insight into the dynamic behaviour of the modelled system. Additionally, the paper describes how sys...
متن کامل